The Lazy Lambda Calculus in a Concurrency Scenario

The Lazy Lambda Calculus in a Concurrency Scenario (Extended Abstract)

The use of -calculus in richer settings, possibly involving parallelism, is examined in terms of the e ect on the equivalence between -terms. We concentrate on Abramsky's lazy -calculus (Abramsky 1989) and we follow two directions. Firstly, the -calculus is studied within a process calculus by examining the equivalence $ induced by Milner's encoding into the -calculus. We start from a character...

Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach

Multiplicative Linear Logic for Resource Transformation Nets p. 81 The Parameterized Complexity of Some Problems in Logic and Linguistics p. 89 Foundations of Proof Search Strategies Design in Linear Logic p. 101 On Extreme Points of Convex Compact Turing Located Set p. 114 Application of Typed Lambda Calculi in the Untyped Lambda Calculus p. 129 Classes with Pairwise Equivalent Enumerations p....

Extending Abramsky's Lazy Lambda Calculus: (Non)-Conservativity of Embeddings

Our motivation is the question whether the lazy lambda calculus, a pure lambda calculus with the leftmost outermost rewriting strategy, considered under observational semantics, or extensions thereof, are an adequate model for semantic equivalences in real-world purely functional programming languages, in particular for a pure core language of Haskell. We explore several extensions of the lazy ...

The Lazy Lambda Calculus

A Typed Lambda Calculus with Categorical Type Constructors

A typed lambda calculus with categorical type constructors is introduced. It has a uniform category theoretic mechanism to declare new types. Its type structure includes categorical objects like products and coproducts as well as recursive types like natural numbers and lists. It also allows duals of recursive types, i.e. lazy types, like infinite lists. It has generalized iterators for recursi...